Sidon in Additive Number Theory . on a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum

نویسنده

  • P. ERDös
چکیده

In a note in this Journal [16 (1941), 212-215], Turan and I proved, among other results, the following : Let a l < a2 < . . . < a, < n be a sequence of positive integers such that the sums aj+a; are all different . Then x < n'1 +0(n1 ) . On the other hand, there exist such sequences with x >n1(2---e), for any e >0 . Recently I noticed that J . Singer, in his paper "A theorem in finite projective geometry and some applications to number theory" [Trans . Amer . Math . Soc., 43 (1938), 377-385], proves, among other results, that, if m is a power of a prime, then there exist m-{-1 numbers aI < a2 < . . . < am+, < m2 -f M+l such that the differences a i -a, are congruent, mod (m2 +M+1), to the integers 1, 2, . . ., m2+M. Clearly the sums a i+a; are all different, and since the quotient of two successive primes tends to 1, Singer's construction gives, for any large n, a set with x. > n2 (1-e), for any e > 0 . Singer's method is quite different from ours . His result shows that the above upper bound for x is best possible, except perhaps for the error term O(nl) .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Phase transitions in number theory: from the birthday problem to Sidon sets.

In this work, we show how number theoretical problems can be fruitfully approached with the tools of statistical physics. We focus on g-Sidon sets, which describe sequences of integers whose pairwise sums are different, and propose a random decision problem which addresses the probability of a random set of k integers to be g-Sidon. First, we provide numerical evidence showing that there is a c...

متن کامل

Sidon Sets in N

We study finite and infinite Sidon sets in N. The additive energy of two sets is used to obtain new upper bounds for the cardinalities of finite Sidon subsets of some sets as well as to provide short proofs of already known results. We also disprove a conjecture of Lindstrom on the largest Sidon set in [1, N ]× [1, N ] and relate it to a known conjecture of Vinogradov concerning the size of the...

متن کامل

Some Old and New Problems on Additive and Combinatorial Number Theory

In this survey paper I will discuss some old and new problems of a somewhat unconventional nature . Proofs will not be given, but I hope they will appear soon in several joint papers of V. T. Sós, Sárközy, and myself. Some of the older results can be found with detailed proofs in the excellent book Sequences of Halberstam and Roth . First of all an old question of Sidon posed to me more than 50...

متن کامل

Sidon Sets in Groups and Induced Subgraphs of Cayley Graphs

Let S be a subset of a group G. We call S a Sidon subset of the first (second) kind, if for any x, y, Z, WE S of which at least 3 are different, xy ~ ZW (xy I "" zwI , resp.). (For abelian groups, the two notions coincide.) If a has a Sidon subset of the second kind with n elements then every n-vertex graph is an induced subgraph of some Cayley graph of G. We prove that a sufficient condition f...

متن کامل

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers

A set A of non-negative integers is called a Sidon set if all the sums a1+a2, with a1 ≤ a2 and a1, a2 ∈ A, are distinct. A well-known problem on Sidon sets is the determination of the maximum possible size F (n) of a Sidon subset of [n] = {0, 1, . . . , n− 1}. Results of Chowla, Erdős, Singer and Turán from the 1940s give that F (n) = (1 + o(1)) √ n. We study Sidon subsets of sparse random sets...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004